Mutually Nearest Vertex Clusters for Solving TSP
نویسندگان
چکیده
The Travelling Salesman Problem (TSP) is a classical problem in the field of combinatorial optimization. Main objective of TSP is to find an optimal tour which starts from an arbitrary city (vertex), visits remaining cities exactly once and returns back to the city at which tour commenced. TSP belongs to the class of NP Complete problems, has been studied for many years and is still being studied; a general solution is yet to be reported.
منابع مشابه
Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm
The Equality Generalized Traveling Salesman Problem (E-GTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit every cluster exactly once. It is well known that any instance of E-GTSP can be transformed into a standard asymmetric instance of the Traveling Salesman Problem (TSP), and therefore solved with a...
متن کاملNew Genetic Operators for Solving TSP: Application to Microarray Gene Ordering
This paper deals with some new operators of genetic algorithms for solving the traveling salesman problem (TSP). These include a new operator called, ”nearest fragment operator” based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. Superiority of these operators has been established on different benchmark data sets for symmetric TSP. Finally, th...
متن کاملA Gaussian Process Regression Model for the Traveling Salesman Problem
Problem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. Approach: In this stu...
متن کاملSolving the Clustered Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm
The Clustered Traveling Salesman Problem (CTSP) is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into clusters, and the salesman has to visit the cities of each cluster consecutively. It is well known that any instance of CTSP can be transformed into a standard instance of the Traveling Salesman Problem (TSP), and therefore solved with a TSP solver....
متن کاملTraveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices for tour construction heuristics, work at acceptable level for the Euclidean TSP, but produce very poor results for the general Symmetric and Asymmetric TSP (STSP and ATSP). We prove that for every n ≥ 2 there is an instance of ATSP (STSP) on n vertices for which GR finds the w...
متن کامل